On probabilistic flooding search over unstructured peer-to-peer networks

نویسندگان

  • Spiridoula V. Margariti
  • Vassilios V. Dimakopoulos
چکیده

Probabilistic flooding has been proposed as a means of reducing the excessive message overheads induced by plain flooding in unstructured peer-to-peer network search. We propose here Advanced Probabilistic Flooding (apf), a novel strategy which operates differently from other known strategies. In particular, the decision of a node to propagate a message (or not) is based on both the popularity of resources and the hop distance from the node that initiated the query. The latter is used to estimate the number of nodes reached by the query message. Based on these parameters we adjust the forwarding probability at the time a node receives the query message so as to reduce the duplicate message overhead while maintaining a high probability of query success. The primary goal of our approach is to minimize the cost of search associated with excessive message transmissions. Our claims are supported by detailed experiments in various network topologies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems"

Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are either inaccurate, because of oversimplification, or analytically inapplicable, due to their high complexity. By recognizing unstructured peer-to-peer networks as “complex systems”, we employ statistical models used before to...

متن کامل

Data Search and Replication in Unstructured Peer-to-Peer Networks

The Peer-to-Peer (P2P) architectures that are most prevalent in today’s internet are decentralized and unstructured. The advantage for this type of networks is that they require no centralized directories and no process control over network topology or data placement. However, the flooding-based query strategy used in these networks does not scale. In this paper, we first introduce three basic ...

متن کامل

An Efficient and Scalable Search Mechanism in Unstructured Peer to Peer Network

Peer-to-peer (P2P) network systems gain a huge popularity due to their scalability and reliability in architectures and search facilities. Basically, most of the real world P2P network is unstructured. Due to their unstructured nature it is often impossible to pre-define the searching criteria. As a solution, flooding scheme is used in most cases. But one major limitation of flooding is its que...

متن کامل

Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks

Designing efficient search algorithms is a key challenge in unstructured peer-to-peer networks. Flooding and random walk (RW) are two typical search algorithms. Flooding searches aggressively and covers the most nodes. However, it generates a large amount of query messages and, thus, does not scale. On the contrary, RW searches conservatively. It only generates a fixed amount of query messages ...

متن کامل

Dynamic Search Algorithm used in Unstructured Peer-to-Peer Networks

Designing efficient search algorithms is a key challenge in unstructured peer-to-peer networks. Flooding and random walk (RW) are two typical search algorithms. Flooding searches aggressively and covers the most nodes. However, it generates a large amount of query messages and, thus, does not scale. On the contrary, RW searches conservatively. It only generates a fixed amount of query messages ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Peer-to-Peer Networking and Applications

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2015